A Tutorial on Well-Composedness

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Well-Composedness in Alexandrov Spaces implies Digital Well-Composedness in Z

In digital topology, it is well-known that, in 2D and in 3D, a digital set X ⊆ Z is digitally well-composed (DWC), i.e., does not contain any critical configuration, if its immersion in the Khalimsky grids H is well-composed in the sense of Alexandrov (AWC), i.e., its boundary is a disjoint union of discrete (n− 1)-surfaces. We show that this is still true in n-D, n ≥ 2, which is of prime impor...

متن کامل

A Tutorial on the Well-Founded Semantics

The well-founded semantics for \normal" logic programs is described using the alternating xpoint construction as the basis. The presentation is informal. The semantics is motivated and illustrated through examples, and is compared brie y with earlier semantics for negation. Extensions to other forms of logic program are mentioned brie y. Recent work on practical implementations and applications...

متن کامل

A tutorial on Quasi-experimental designs

A main step in answering a scientific hypothesis in an epidemiological study is deciding which type of study is suitable to be undertaken, considering methodology, practical considerations and budget and time limitations

متن کامل

Medical nanobiosensors: A tutorial review

A sensitive monitoring of biological analytes, such as biomolecules (protein, lipid, DNA and RNA), and biological cells (blood cell, virus and bacteria), is essential to assess and avoid risks for human health. Nanobiosensors, analytical devices that combine a biologically sensitive element with a nanostructured transducer, are being widely used for molecular detection of biomarkers associated ...

متن کامل

Well-founded Functions and Extreme Predicates in Dafny: A Tutorial

A recursive function is well defined if its every recursive call corresponds a decrease in some well-founded order. Such well-founded functions are useful for example in computer programs when computing a value from some input. A boolean function can also be defined as an extreme solution to a recurrence relation, that is, as a least or greatest fixpoint of some functor. Such extreme predicates...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Imaging and Vision

سال: 2017

ISSN: 0924-9907,1573-7683

DOI: 10.1007/s10851-017-0769-6